Poly-Dimension of Antimatroids
نویسندگان
چکیده
A partial cube is a graph that can be isometrically embedded into a hypercube. In other words, a partial cube is a subgraph of a hypercube that preserves distances the distance between any two vertices in the subgraph is the same as the distance between those vertices in the hypercube. Partial cubes were first introduced by Graham and Pollak (Graham & Pollak, 1971) as a model for communication networks and were extensively studied afterwards.
منابع مشابه
Geometry of antimatroidal point sets
The notion of ”antimatroid with repetition” was conceived by Bjorner, Lovasz and Shor in 1991 as a multiset extension of the notion of antimatroid [2]. When the underlying set consists of only two elements, such two-dimensional antimatroids correspond to point sets in the plane. In this research we concentrate on geometrical properties of antimatroidal point sets in the plane and prove that the...
متن کاملThe forbidden minor characterization of line-search antimatroids of rooted digraphs
An antimatroid is an accessible union-closed family of subsets of a 0nite set. A number of classes of antimatroids are closed under taking minors such as point-search antimatroids of rooted (di)graphs, line-search antimatroids of rooted (di)graphs, shelling antimatroids of rooted trees, shelling antimatroids of posets, etc. The forbidden minor characterizations are known for point-search antima...
متن کاملErc Sets and Antimatroids
Grammars in Optimality Theory can be characterized by sets of Ercs (Elementary Ranking Conditions). Antimatroids are structures that arose initially in the study of lattices. In this paper we prove that antimatroids and consistent Erc sets have the same formal structures. We do so by defining two functions MChain and RCerc, MChain being a function from consistent sets of Ercs to antimatroids an...
متن کاملOn the shelling antimatroids of split graphs
Chordal graph shelling antimatroids have received little attention with regard to their combinatorial properties and related optimization problems, as compared to the case of poset shelling antimatroids. Here we consider a special case of these antimatroids, namely the split graph shelling antimatroids. We show that the feasible sets of such an antimatroid relate to some poset shelling antimatr...
متن کاملCorrespondence between two Antimatroid Algorithmic Characterizations
The basic distinction between already known algorithmic characterizations of matroids and antimatroids is in the fact that for antimatroids the ordering of elements is of great importance. While antimatroids can also be characterized as set systems, the question whether there is an algorithmic description of antimatroids in terms of sets and set functions was open for some period of time. This ...
متن کامل